Minimum spanning tree

Results: 280



#Item
191Connectivity / Centrality / Graph / Adjacency matrix / Minimum spanning tree / Topology / Eigenvalues and eigenvectors / Degree / Graph partition / Graph theory / Mathematics / Line graph

Gelling, and Melting, Large Graphs by Edge Manipulation Hanghang Tong B. Aditya Prakash Tina Eliassi-Rad

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2012-11-01 14:04:55
192Classical genetics / Genetic linkage / Doubled haploidy / Cluster analysis / Centimorgan / Hierarchical clustering / Genetic algorithm / Minimum spanning tree / Travelling salesman problem / Statistics / Biology / Genetics

Efficient and Accurate Construction of Genetic Linkage Maps from Noisy and Missing Genotyping Data Yonghui Wu1 , Prasanna Bhat2 , Timothy J. Close2 , and Stefano Lonardi1, 1 Dept. of Computer Science and Eng., Universi

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2007-06-21 16:26:47
193Mathematical optimization / Operations research / Optimal control / Systems engineering / Systems theory / Tree / Systems science / Minimum spanning tree / Mathematics / Dynamic programming / Equations

A Survey on Tree Edit Distance and Related Problems Philip Bille∗ The IT University of Copenhagen Glentevej 67, DK-2400 Copenhagen NV, Denmark. Email: [removed].

Add to Reading List

Source URL: grfia.dlsi.ua.es

Language: English - Date: 2007-04-10 04:27:49
194Tree / Connectivity / Adjacency matrix / Graph coloring / Minimum spanning tree / Trapezoid graph / Graph theory / Mathematics / Graph

Acta Univ. Sapientiae, Mathematica, 5, [removed]–82 Leader election in synchronous networks Antal Iv´anyi Faculty of Informatics E¨otv¨os Lor´and University

Add to Reading List

Source URL: www.emis.de

Language: English - Date: 2014-03-04 12:13:44
195Routing algorithms / Spanning tree / Routing / Minimum spanning tree / Bellman–Ford algorithm / Shortest path problem / Wireless Routing Protocol / IEEE 802.1aq / Theoretical computer science / Mathematics / Graph theory

Kinetic Spanning Trees for Minimum-Power Routing in MANETS Camillo Gentile and Robert E. Van Dyck National Institute of Standards and Technology Wireless Communications Technologies Group Gaithersburg, MD[removed]cgentile,

Add to Reading List

Source URL: w3.antd.nist.gov

Language: English - Date: 2009-02-03 16:25:35
196NP-complete problems / Vertex / Graph partition / Distance / Connected component / Matching / Minimum spanning tree / Connectivity / Graph theory / Theoretical computer science / Mathematics

Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing Zuhair Khayyat‡ Karim Awara‡

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2013-06-23 20:27:26
197Science / Lexical semantics / Mathematics / Belief propagation / Coding theory / WordNet / Cyc / Graphical model / Minimum spanning tree / Linguistics / Computational linguistics / Knowledge representation

Structured Learning for Taxonomy Induction with Belief Propagation Mohit Bansal TTI Chicago [removed] David Burkett

Add to Reading List

Source URL: nlp.cs.berkeley.edu

Language: English - Date: 2014-11-13 15:24:06
198Spanning tree / Graphical models / Probability theory / Minimum spanning tree / NP-complete problems / Belief propagation / Tree decomposition / Connectivity / Markov random field / Graph theory / Mathematics / Theoretical computer science

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY[removed]A New Class of Upper Bounds on the Log Partition Function

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-08-15 12:26:48
199Network flow / Spanning tree / Vertex / Graph / Centrality / Flow network / Tree / Connectivity / Minimum spanning tree / Graph theory / Mathematics / Network theory

Density based approaches to network analysis Analysis of Reuters terror news network Vladimir Batagelj, Andrej Mrvar University of Ljubljana [removed]

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2003-08-05 12:41:01
200NP-complete problems / Matching / Clique problem / Independent set / Minimum spanning tree / Computing the permanent / Interval graph / Factor-critical graph / Bipartite graph / Graph theory / Mathematics / Theoretical computer science

Matching is as Easy as Matrix Inversion Ketan Mulmuley ’ Computer Science Department University of California, Berkeley Umesh V. Vazirani 2

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-09-11 21:07:28
UPDATE